Secret Key Generation for a Pairwise Independent Network Model
نویسندگان
چکیده
منابع مشابه
Pairwise Independent Key Generation Algorithm: A Survey
Key Generation is a technique to provide a secure and efficient generation of Key Pairs so that the keys can’t be attacked by the external or unauthorized users. Since there are various techniques implemented for the generation of keys such as based on Graphical Methods [1]. Here in this paper a review of all the existing techniques implemented for the generation of Key Pairs is analyzed and di...
متن کاملMobility Independent Secret Key Generation for Wearable Health-care Devices
Security in Wireless Body Area Networks (WBAN) is of major concern as the miniature personal health-care devices need to protect the sensitive health information transmitted in wireless medium. It is essential for these devices to generate the shared secret key used for data encryption periodically. Recent studies have exploited wireless channel characteristics, e.g., received signal strength i...
متن کاملSecret Key Generation for Fading Wireless Channel
The multipath-rich wireless atmosphere allied with typical wireless usage scenarios is characterized by a vanishing channel retort that is time-varying, location-sensitive, and only shared by a given transmitter–receiver pair. The complexity allied with a highly scattering atmosphere implies that the short-term vanishing process is intrinsically hard to envisage and best modeled stochastically,...
متن کاملNetwork Coding Protocols for Secret Key Distribution
Recent contributions have uncovered the potential of network coding, i.e. algebraic mixing of multiple information flows in a network, to provide enhanced security in packet oriented wireless networks. We focus on exploiting network coding for secret key distribution in a sensor network with a mobile node. Our main contribution is a set of extensions for a simple XOR based scheme, which is show...
متن کاملPairwise Secret Key Agreement based on Location-derived Common Randomness
A source model of key sharing between three users is considered in which each pair of them wishes to agree on a secret key hidden from the remaining user. There are ratelimited public channels for communications between the users. We give an inner bound on the secret key capacity region in this framework. Moreover, we investigate a practical setup in which localization information of the users ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2010
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2010.2081210